Desnaki cation of Mesh Sorting Algorithms

In all recent near optimal sorting algorithms for meshes the packets are sorted with respect to some snake like in dexing In this paper we present deterministic algorithms for sorting with respect to the more natural row major indexing For sorting on an n n mesh we give an algorithm that runs in n o n steps with maximal queue size ve It is considerably simpler than earlier algorithms Another algorithm performs k k sorting in k n o k n steps Furthermore we present uni axial algorithms for row major sorting Uni axial algorithms have clear practical and theoretical advantages over bi axial algorithms We show that sorting can be performed in n o n steps Alternatively this problem is solved in n steps for all n For the practically important values of n this algorithm is much faster than any algorithm with good asymptotical performance